Permutation groups, pattern involvement, and Galois connections

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Galois Groups as Permutation Groups

Writing f(T ) = (T − r1) · · · (T − rn), the splitting field of f(T ) over K is K(r1, . . . , rn). Each σ in the Galois group of f(T ) over K permutes the ri’s since σ fixes K and therefore f(r) = 0⇒ f(σ(r)) = 0. The automorphism σ is completely determined by its permutation of the ri’s since the ri’s generate the splitting field over K. A permutation of the ri’s can be viewed as a permutation ...

متن کامل

Galois as Permutation Groups

Writing f(X) = (X− r1) · · · (X− rn), the splitting field of f(X) over K is K(r1, . . . , rn). Each σ in the Galois group of f(X) over K permutes the ri’s since σ fixes K and therefore f(r) = 0⇒ f(σ(r)) = 0. The automorphism σ is completely determined by its permutation of the ri’s since the ri’s generate the splitting field over K. A permutation of the ri’s can be viewed as a permutation of th...

متن کامل

Galois Theory for Iterative Connections and Nonreduced Galois Groups

This article presents a theory of modules with iterative connection. This theory is a generalisation of the theory of modules with connection in characteristic zero to modules over rings of arbitrary characteristic. We show that these modules with iterative connection (and also the modules with integrable iterative connection) form a Tannakian category, assuming some nice properties for the und...

متن کامل

Galois Connections among Fuzzy Groups, Similarities and Distances

Given a set S, we deene Galois connections between the lattice of fuzzy subgroups of transformations in S, the lattice of the similarities in S and the lattice of the distances in S.

متن کامل

Pair algebras and Galois connections

Most studies of Galois connections begin with a function and ask the question: when is there a second function that is connected to the first? In possibly the very first application of Galois connections directly related to the modern digital computer, Hartmanis and Stearns posed a. subtly different question, namely: when does a relation define two functions that are Ga'!ois connected? Such a r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Scientiarum Mathematicarum

سال: 2017

ISSN: 0001-6969

DOI: 10.14232/actasm-017-510-4